High Performance Unconstrained Word Recognition System Combining HMMs and Markov Random Fields

نویسندگان

  • George Saon
  • Abdel Belaïd
چکیده

In this paper we present a system for the recognition of handwritten words on literal cheque amounts which advantageously combine hmms and Markov random elds mrfs It operates at pixel level in a holistic manner on height normalized word images which are viewed as random eld realizations The hmm analyzes the image along the horizontal writing direction in a speci c state observation probabil ity given by the column product of causal mrf like pixel conditional probabilities Aspects concerning de nition training and recognition via this type of model are developed throughout the paper We report a average word recognition rate on words and a amount rate on amounts of the srtp French postal cheque database words amounts di erent scriptors

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of unconstrained handwritten words using Markov random fields and HMMs

In this paper we present a system for recognition of handwritten words on literal check amounts which advantageously combines HMMs and Markov random fields (MRFs). It operates, in a holistic manner, at pixel level on height normalised word images which are viewed as random field realizations. The HMM analyses the image along the horizontal writing direction, in a specific state observation prob...

متن کامل

High Performance Unconstrained Word

In this paper we present a system for the recognition of handwritten words on literal cheque amounts which advantageously combine hmms and Markov random elds (mrfs). It operates at pixel level, in a holistic manner, on height normalized word images which are viewed as random eld realizations. The hmm analyzes the image along the horizontal writing direction, in a speciic state observation proba...

متن کامل

Analytic Word Recognition without Segmentation Based on Markov Random Fields

In this paper, a method for analytic handwritten word recognition based on causal Markov random fields is described. The words models are HMMs where each state corresponds to a letter; each letter is modelled by a NSHP-HMM (Markov field). Global models are build dynamically, and used for recognition and learning with the Baum-Welch algorithm. Learning of letter and word models is made using the...

متن کامل

Arabic Handwritten Word Recognition Using HMMs with Explicit State Duration

We describe an offline unconstrained Arabic handwritten word recognition system based on segmentation-free approach and discrete hidden Markov models (HMMs) with explicit state duration. Character durations play a significant part in the recognition of cursive handwriting. The duration information is still mostly disregarded in HMM-based automatic cursive handwriting recognizers due to the fact...

متن کامل

Binary pattern recognition using Markov random fields and HMMs

In this paper we present a stochastic framework for the recognition of binary random patterns which advantageously combine hmms and Markov random elds (mrfs). The hmm component of the model analyzes the image along one direction, in a speci c state observation probability given by the product of causal mrf-like pixel conditional probabilities. Aspects concerning de nition, training and recognit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJPRAI

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1997